Existence of some signed magic arrays
نویسندگان
چکیده
منابع مشابه
Sparse anti-magic squares and vertex-magic labelings of bipartite graphs
A sparse anti-magic square is an n×n array whose non-zero entries are the consecutive integers 1, · · · ,m for some m ≤ n and whose rowsums and column-sums form a set of consecutive integers. We derive some basic properties of these arrays and provide constructions for several infinite families of them. Our main interest in these arrays is their application to constructing vertex-magic labeling...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملMagic rectangle sets of odd order
A magic rectangle set M = MRS(a, b; c) is a collection of c arrays (a × b) whose entries are elements of {1, 2, . . . , abc}, each appearing once, with all row sums in every rectangle equal to a constant ρ and all column sums in every rectangle equal to a constant σ. It was proved in [2] that if an MRS(a, b; c) exists, then a ≡ b (mod 2). It was also proved there that if a ≡ b ≡ 0 (mod 2) and b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 340 شماره
صفحات -
تاریخ انتشار 2017